ar X iv : m at h / 06 10 98 4 v 1 [ m at h . C O ] 3 1 O ct 2 00 6 COLORED POSETS AND COLORED QUASISYMMETRIC FUNCTIONS
نویسنده
چکیده
The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this approach we introduce colored analogs of P -partitions and enriched P -partitions. We also frame our results in terms of Aguiar, Bergeron, and Sottile’s theory of combinatorial Hopf algebras and its colored analog.
منابع مشابه
Colored Posets and Colored Quasisymmetric Functions
The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this approach we introduce colored analogs of P -partitions and enriched P -partitions. We also frame our results in terms of Aguiar, Bergeron, and Sottile’s the...
متن کاملCombinatorics of stable polynomials and correlation inequalities
This thesis contains five papers divided into two parts. In the first part, Papers I–IV, we study polynomials within the field of combinatorics. Here we study combinatorial properties as well as the zero distribution of the polynomials in question. The second part consists of Paper V, where we study correlating events in randomly oriented graphs. In Paper I we give a new combinatorial interpret...
متن کاملA property of colored complexes and their duals
A ranked poset P is a Macaulay poset if there is a linear order of the elements of P such that for any m; i the set C(m; i) of the m (with respect to) smallest elements of rank i has minimum{sized shadow among all m{element subsets of the i{th level, and the shadow of C(m; i) consists of the smallest elements of the (i ? 1){st level. P is called shadow{increasing if for all m; i the shadow of C...
متن کاملThe m-Colored Composition Poset
We generalize Björner and Stanley’s poset of compositions to m-colored compositions. Their work draws many analogies between their (1-colored) composition poset and Young’s lattice of partitions, including links to (quasi-)symmetric functions and representation theory. Here we show that many of these analogies hold for any number of colors. While many of the proofs for Björner and Stanley’s pos...
متن کاملPreimages of Small Geometric Cycles
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A classic problem is to characterize the family of homomorphic preimages of a given graph H. A geometric graph G is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position A geometric homomorphism (resp. ...
متن کامل